Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA
نویسندگان
چکیده
We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets overloaded synchronous code-division multiple access (CDMA) systems, where number signals Kamax is largest known given length L. In our complexity analysis, we illustrate that compared to maximum-likelihood (ML) decoder, which has an exponential computational even moderate lengths, proposed quasi-quadratic complexity. Simulation results in terms bit-error-rate (BER) demonstrate performance only 1-2 dB degradation signal-to-noise ratio (SNR) at BER 10^-3 when ML. Moreover, derive proof minimum Manhattan distance such UD codes and provide proofs propositions; these constitute foundation formal maximum users L=8 .
منابع مشابه
Set of uniquely decodable codes for overloaded synchronous CDMA
In this paper, we consider the designing of a new set of Uniquely Decodable Codes (UDC) for uncoded synchronous overloaded Code Division Multiple Access (CDMA) for the number of codes exceeding the assigned code length. For the construction, the proposed recursive method at iterationk generates a matrix that can be classified into k orthogonal subsets of different dimensions. Out of them, all b...
متن کاملUniquely Decodable Codes and Decoder for Overloaded Synchronous Cdma Systems Field of Invention
A recursive method for constructing uniquely decodable codes for overloaded synchronous CDMA systems, Where large signature codes With groWing overloading factors are reconstructed from the small ones. A class of uniquely decod able signature matrices (or encoders) for overloaded synchro nous CDMA are also devised. A decoder for synchronous CDMA systems to extract the user data by a number of c...
متن کاملNew Power Estimation Methods for Highly Overloaded Synchronous CDMA Systems
In CDMA systems, the received user powers vary due to moving distance of users. Thus, the CDMA receivers consist of two stages. The first stage is the power estimator and the second one is a Multi-User Detector (MUD). Conventional methods for estimating the user powers are suitable for underor fully-loaded cases (when the number of users is less than or equal to the spreading gain). These metho...
متن کاملUniquely decodable n-gram embeddings
We define the family of n-gram embeddings from strings over a finite alphabet into the semimodule N . We classify all ∈ N that are valid images of strings under such embeddings, as well as all whose inverse image consists of exactly 1 string (we call such uniquely decodable). We prove that for a fixed alphabet, the set of all strings whose image is uniquely decodable is a regular language. © 20...
متن کاملLow Complexity Decoder for CCSDS Turbo codes
Error correction codes are a means of including redundancy in a stream of information bits to allow the detection and correction of symbol errors during transmission. In Forward Error Correction (FEC) it is desirable to have low Bit Error Rates (BER) and low decoder complexity for reliable data transmission Turbo code is a great achievement in the field of communication system. Turbo code also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3170491